Model Reuse With Reduced Kernel Mean Embedding Specification

نویسندگان

چکیده

Given a publicly available pool of machine learning models constructed for various tasks, when user plans to build model her own application, is it possible upon in the such that previous efforts on these existing can be reused rather than starting from scratch? Here, grand challenge how find are helpful current without accessing raw training data pool. In this paper, we present two-phase framework. upload phase, uploading into pool, construct reduced kernel mean embedding (RKME) as specification model. Then deployment relatedness task and pre-trained will measured based value RKME specification. Theoretical results extensive experiments validate effectiveness our approach.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Imitation Learning via Kernel Mean Embedding

Imitation learning refers to the problem where an agent learns a policy that mimics the demonstration provided by the expert, without any information on the cost function of the environment. Classical approaches to imitation learning usually rely on a restrictive class of cost functions that best explains the expert’s demonstration, exemplified by linear functions of pre-defined features on sta...

متن کامل

Kernel Mean Embedding of Distributions: A Review and Beyond

A Hilbert space embedding of a distribution—in short, a kernel mean embedding—has recently emerged as a powerful tool for machine learning and inference. The basic idea behind this framework is to map distributions into a reproducing kernel Hilbert space (RKHS) in which the whole arsenal of kernel methods can be extended to probability measures. It can be viewed as a generalization of the origi...

متن کامل

Nonparametric Detection of Anomalous Data Streams via Kernel Mean Embedding

A nonparametric anomalous hypothesis testing problem is investigated, in which there are totally n sequences with s anomalous sequences to be detected. Each typical sequence contains m independent and identically distributed (i.i.d.) samples drawn from a distribution p, whereas each anomalous sequence containsm i.i.d. samples drawn from a distribution q that is distinct from p. The distribution...

متن کامل

Compositional Specification and Reuse of a Generic Cooperative Agent Model

In this paper one of the informally described models of agent co-operation (Jennings, 1995) has been used to develop and formally specify a generic model of a co-operative agent (GCAM). The compositional development method for multi-agent systems DESIRE supported the principled design of this model of cooperation. To illustrate reusability of the generic model, two application domains have been...

متن کامل

Kernel least mean square with adaptive kernel size

Kernel adaptive filters (KAF) are a class of powerful nonlinear filters developed in Reproducing Kernel Hilbert Space (RKHS). The Gaussian kernel is usually the default kernel in KAF algorithms, but selecting the proper kernel size (bandwidth) is still an open important issue especially for learning with small sample sizes. In previous research, the kernel size was set manually or estimated in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering

سال: 2023

ISSN: ['1558-2191', '1041-4347', '2326-3865']

DOI: https://doi.org/10.1109/tkde.2021.3086619